CSCI 2951 - G : Computational Protein Folding Fall 2012 Lectures 3 and 4 — 09 / 12 / 2012 and 9 / 17 / 2012
نویسندگان
چکیده
We will start with a review of some calculus. We start with one dimension to give intuition for higher dimensions. Given a function from one variable to one variable, for example, f(x) = x, we can approximate it via its derivatives. The most trivial approximation is without derivatives: we can approximate f(x) near c by just the constant f(c). But if f is rapidly changing (has large derivative) then this estimate will become rapidly bad. Approximating f(x) = x near c = 1 yields the approximation x ≈ 1 near 1. How bad is this approximation? If we evaluate the function at 1.1 then 1.1 = 1.21, and our trivial approximation is off by 0.21. Why does this number make sense? Well, our constant approximation is ignoring the first derivative – the derivative of x is 2x, which is 2 when evaluated at our center, c = 1. Thus if we move 0.1 away from our center and ignore a derivative of 2, we would expect our estimate to be off by roughly 0.2. And indeed, 0.21 is pretty close to 0.2. This suggests a more sophisticated approximation: the constant approximation at 1, plus our difference from 1 multiplied by the derivative at 1. This is the first-order approximation around c: f(x) ≈ f(c) + f ′(c) · (x− c). In our case, for f(x) = x, the approximation around 1 is x ≈ 1 + 2 · (x− 1) = 2x− 1. How accurate is this approximation? Well, for x = 1.1 the approximation yields 1.2 as compared to x = 1.21; namely, we are off by 0.01, which is much better than before. Where does this 0.01 come from? The second derivative. Analogously with what we just saw, where ignoring the 1st derivative gives an error proportional to the first derivative and proportional to the distance from the center c, ignoring the second derivative will yield error that is proportional to the second derivative and proportional to the distance from the center squared. The second-order approximation near c, analogously, will be f(x) ≈ f(c)+f ′(c)·(x−c)+ 1 2f ′′(c)·(x−c)2. For the case of f(x) = x the second derivative is 2, and thus the approximation around 1 is 1+2(x−1)+(x−1) which is exactly x. This makes sense since any errors in this approximation would come from the 3rd derivative, which is 0 everywhere for f(x) = x. (If you were wondering why we scale f ′′ by a half, this equality justifies why it cannot be any other way; in general, the nth derivative is scaled by n!, because the nth derivative corresponds to a term involving (x− c), and its nth derivative is n!, which we need to cancel out.) Some of the approximations of this form which are particularly useful are that x near 1 is roughly 1 + a(x− 1), e near 0 is roughly 1 + x (and log x near 1 is roughly x− 1), sin(x) near 0 is roughly x, and cos(x) near 0 is roughly 1− x/2. If any of the above is unclear, draw diagrams with Matlab.
منابع مشابه
Expounding the First Incompleteness Theorem
Part 1. From Gödel 1931 to Kleene 1943 2 1. Notation and terminology 2 2. Gödel 1931: in the beginning 3 3. Tarksi 1933: truth (but not proof) 7 4. Gödel 1934: the Princeton lectures 8 5. Carnap 1934: does he prove the diagonal lemma? 11 6. Kleene 1936: general recursive functions and a new proof 12 7. Rosser 1936: strengthening the first theorem 13 8. Turing 1936, 1938: incompleteness assumed ...
متن کاملEla Lower Bounds for the Estrada Index of Graphs
The Estrada index was used to study the folding degree of proteins and other long-chain molecules [4, 5, 6, 9]. It also has numerous applications in the vast field of complex networks [7, 8, 13, 14, 17]. A number of properties especially lower and upper bounds [3, 10, 11, 12, 15, 16, 18, 19, 20] for the Estrada index are known. In this paper, we establish further lower bounds improving some res...
متن کاملTask Offloading between Smartphones and Distributed Computational Resources
.................................................................................................................. viii 1. Introduction .................................................................................................................. 1 1.1 Motivations ........................................................................................................ 1 1.2 Structure of T...
متن کاملFirearm Classification Based on Numerical Features of the Firing Pin Impression
07:30 – 8:30 Transfer from Centara Grand at Central Plaza Ladprao Bangkok to Sirindhorn Science Home, Thailand Science Park, Pathumthani 08:30 – 9:00 Registration [Foyer, Sirindhorn Science Home] 09:00 – 12:00 Workshop I [Lecture 1, Sirindhorn Science Home] Bairong Shen (Director, Center for Systems Biology, Soochow University, China), Systems biology with R 09:00 – 12:00 Workshop II [Lecture 2...
متن کاملUniversity of Florida College of Dentistry.
DMD Program Graduate Program University SUMMER 2012 Summer semester (A/C) begins April 23 May 14 May 14 National Boards Part I Block (3DN) April 23-May 7 4DN Clinic Ends May 3 Senior Banquet May 5 3DN Clinic Orientation May 8 Florida State Board Exam May 11 13 Graduation Certification May 16 Senior Check-out April 30 May16 Spring Graduation and Commencement May 18 May 18 May 4-5 Memorial Day Ho...
متن کامل